Synthesis of Greedy Algorithms Using Dominance Relations
نویسندگان
چکیده
Greedy algorithms exploit problem structure and constraints to achieve linear-time performance. Yet there is still no completely satisfactory way of constructing greedy algorithms. For example, the Greedy Algorithm of Edmonds depends upon translating a problem into an algebraic structure called a matroid, but the existence of such a translation can be as hard to determine as the existence of a greedy algorithm itself. An alternative characterization of greedy algorithms is in terms of dominance relations, a well-known algorithmic technique used to prune search spaces. We demonstrate a process by which dominance relations can be methodically derived for a number of greedy algorithms, including activity selection, and prefix-free codes. By incorporating our approach into an existing framework for algorithm synthesis, we demonstrate that it could be the basis for an effective engineering method for greedy algorithms. We also compare our approach with other characterizations of greedy algorithms.
منابع مشابه
Theory and Techniques for Synthesizing Space-efficient Breadth-first Search Algorithms
Although Breadth-First Search (BFS) has several advantages over DepthFirst Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over in favor of DFS. To address this shortcoming, we introduce a theory of space-e cient BFS (SEBFS) along with a simple recursive program schema for carrying out the search. The theory is based on dominance relations, a lo...
متن کاملDominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time. We describe dominance rules for these criteria, as well as techniques for using these dominance rules to build heuristic solutions. We use them to improve certain well-known greedy heuristic algorithms from the liter...
متن کاملDominance-Based Heuristics for One-Machine Total Cost Problems
We study the one-machine problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time. We describe dominance rules for these criteria, as well as techniques for using these dominance rules to build heuristic solutions. We use them to improve certain well-known greedy heuristic algorithms from the literature. Fina...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملFrom Dynamic Programming to Greedy Algorithms
A calculus of relations is used to reason about speciications and algorithms for optimi-sation problems. It is shown how certain greedy algorithms can be seen as reenements of dynamic programming. Throughout, the maximum lateness problem is used as a motivating example.
متن کامل